Connection between Dijkstra's Predicate-Transformers and Denotational Continuation-Semantics
نویسندگان
چکیده
منابع مشابه
Predicate Transformers and Linear Logic: Yet Another Denotational Model
In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a category enjoying many algebraic properties. We build on this structure to make predicate transformers into a denotational model of full linear logic: all the logical constructions have a natural interpretation in term...
متن کاملPredicate transformers in the semantics of Circus
Circus is a combination of Z and CSP; its chief distinguishing feature is the inclusion of the ideas of the refinement calculus. Our main objective is the definition of refinement methods for concurrent programs. The original semantic model for Circus is Hoare and He’s unifying theories of programming. In this paper, we present an equivalent semantics based on predicate transformers. With this ...
متن کاملTowards a Denotational Semantics for Concurrent State Transformers
Concurrent state transformers are an extension of state transformers investigated by Launchbury, Peyton Jones, Wadler, and others by concurrency primitives. A denotational semantics for state transformers executing in parallel is deened using standard domain theoretic techniques. Using the semantics it is proved that concurrent state transformers still form a monad and that the concurrent seman...
متن کاملIsomorphisms between Predicate and State Transformers
We study the relation between state transformers based on directed complete partial orders and predicate transformers. Concepts likèpredicate', `liveness', `safety' and`predicate transformers' are formulated in a topological setting. We treat state transformers based on the Hoare, Smyth and Plotkin powerdomains and consider continuous, monotonic and unrestricted functions. We relate the transfo...
متن کاملUnderapproximating Predicate Transformers
We study the underapproximation of the predicate transformers used to give semantics to the modalities in dynamic and temporal logic. Because predicate transformers operate on state sets, we define appropriate powerdomains for sound approximation. We study four such domains — two are based on “set inclusion” approximation, and two are based on “quantification” approximation — and we apply the d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DAIMI Report Series
سال: 1978
ISSN: 2245-9316,0105-8517
DOI: 10.7146/dpb.v7i86.6502